|
In mathematics, a permutation polynomial (for a given ring) is a polynomial that acts as a permutation of the elements of the ring, i.e. the map is a bijection. In case the ring is a finite field, the Dickson polynomials, which are closely related to the Chebyshev polynomials, provide examples. Over a finite field, every function, so in particular every permutation of the elements of that field, can be written as a polynomial function. In the case of finite rings Z/''n''Z, such polynomials have also been studied and applied in the interleaver component of error detection and correction algorithms. ==Quadratic permutation polynomials (QPP) == For the finite ring Z/''n''Z one can construct quadratic permutation polynomials. Actually it is possible if and only if ''n'' is divisible by ''p2'' for some prime number ''p''. The construction is surprisingly simple, nevertheless it can produce permutations with certain good properties. That is why it has been used in the interleaver component of turbo codes in 3GPP Long Term Evolution mobile telecommunication standard (see 3GPP technical specification 36.212 〔(3GPP TS 36.212 )〕 e.g. page 14 in version 8.8.0). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Permutation polynomial」の詳細全文を読む スポンサード リンク
|